About the largest subtree common to several X-trees
نویسندگان
چکیده
منابع مشابه
About the largest subtree common to several X-trees
résumé – Etant donnés plusieurs X-arbres, ou arbres phylogénétiques, sur le même ensemble X, nous cherchons à construire un plus grand sous-ensemble Y ⊂ X tel que les arbres partiels induits sur Y soient identiques d’un point de vue topologique, c’est-à-dire indépendemment des longueurs des arêtes. Ce problème, connu sous le nom de MAST (Maximum Agreement SubTree), est NP-Difficile, dans le cas...
متن کاملAbout the Largest Subtree Common to Several Phylogenetic Trees
Given several phylogenetic trees on the same set of taxa X, we look for a largest subset Y in X such that all the partial trees reduced by Y are identical. The problem has polynomial complexity when there are only two trees but it is NP-hard for more than two. We introduce a polynomial approximation algorithm for the multiple case, which is easy to implement, very efficient and which produces a...
متن کاملApproximation Algorithms for the Largest Common Subtree Problem
The largest common subtree problem is to nd a largest tree which occurs as a common subgraph in a given collection of trees. Let n denote the number of vertices in the largest tree in the collection. We show that in the case of bounded degree trees, it is possible to achieve an approximation ratio of O(n(log logn)= log n). For unbounded degree trees, we give an algorithm with approximation rati...
متن کاملOn the Maximum Common Embedded Subtree Problem for Ordered Trees
The maximum common embedded subtree problem, which generalizes the minor containment problem on trees, is reduced for ordered trees to a variant of the longest common subsequence problem. While the maximum common embedded subtree problem is known to be APX-hard for unordered trees, an exact solution for ordered trees can be found in polynomial time. In this paper, the longest common balanced se...
متن کاملThe Subtree Size Profile of Bucket Recursive Trees
Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathématiques et sciences humaines
سال: 2010
ISSN: 0987-6936,1950-6821
DOI: 10.4000/msh.11751